Walking, hopping and jumping: a model of transcription factor dynamics on DNA

We present a model of how transcription factors scan DNA to find their specific binding sites. Following the classical work of Winter et al. (1981), our model assumes two modes of transcription factor dynamics. Adjacent moves, where the proteins make a single step movement to one side, or short walks where the transcription factors slide along the DNA several binding sites at a time. The purpose of this article is twofold. Firstly, we discuss how such a system can be efficiently modeled computationally. Secondly, we analyse how the mean first binding times of transcription factors to their specific time depends on key parameters of the system

Evolving Biological Systems: Evolutionary Pressure to Inefficiency

The evolution of quantitative details (i.e. “parameter values”) of biological systems is highly under-researched. We use evolutionary algorithms to co-evolve parameters for a generic but biologically plausible topological differential equation model of nutrient uptake. In our model, evolving cells compete for a finite pool of nutrient resources. From our investigations it emerges that the choice of values is very important for the properties of the biological system. Our analysis also shows that clonal populations that are not subject to competition from other species best grow at a very slow rate. However, if there is co-evolutionary pressure, that is, if a population of clones has to compete with other cells, then the fast growth is essential, so as not to leave resources to the competitor. We find that this strategy, while favoured evolutionarily, is inef- ficient from an energetic point of view, that is less growth is achieved per unit of input nutrient. We conclude, that competition can lead to an evolutionary pressure towards inefficiency

Evolving strategies for single-celled organisms in multi-nutrient environments

When micro-organisms are in environments with multiple nutrients, they often preferentially utilise one first. A second is only utilised once the first is exhausted. Such a two-phase growth pattern is known as diauxic growth. Experimentally, this manifests itself through two distinct exponential growth phases separated by a lag phase of arrested growth. The dura- tion of the lag phase can be quite substantial. From an evolu- tionary point of view the existence of a lag phase is somewhat puzzling because it implies a substantial loss of growth op- portunity. Mutants with shorter lag phases would be prone to outcompete those with longer phases. Yet in nature, diauxic growth with lag phases appears to be a robust phenomenon. We introduce a model of the evolution of diauxic growth that captures the basic interactions regulating it in bacteria. We observe its evolution without a lag phase. We conclude that the lag phase is an adaptation that is only beneficial when fit- ness is averaged over a large number of environments

Navigating the Information Highway: A Multilayered Approach for First-Year Graduate Students

Taylor University’s Zondervan Library developed a multifaceted approach of engagement with graduate students of the Master of Higher Education and Student Development program, utilizing a variety of venues and courses relating to advanced research and writing. Regular assessments provided feedback for improvement within the embedded program structure. A second component of this model involved an archival project, which facilitated student research with primary documents in the university archives. Overall, graduate student understanding and ownership of the research process increased, and teaching faculty noticed improvement in the quality of research-based assignments as well as the program’s thesis project

A search algorithm for a class of optimal finite-precision controller realization problems with saddle points

With game theory, we review the optimal digital controller realization problems that maximize a finite word length (FWL) closed-loop stability measure. For a large class of these optimal FWL controller realization problems which have saddle points, a minimax-based search algorithm is derived for finding a global optimal solution. The algorithm consists of two stages. In the first stage, the closed form of a transformation set is constructed which contains global optimal solutions. In the second stage, a subgradient approach searches this transformation set to obtain a global optimal solution. This algorithm does not suffer from the usual drawbacks associated with using direct numerical optimization methods to tackle these FWL realization problems. Furthermore, for a small class of optimal FWL controller realization problems which have no saddle point, the proposed algorithm also provides useful information to help solve them

Optimal realizations of floating-point implemented digital controllers with finite word length considerations.

The closed-loop stability issue of finite word length (FWL) realizations is investigated for digital controllers implemented in floating-point arithmetic. Unlike the existing methods which only address the effect of the mantissa bits in floating-point implementation to the sensitivity of closed-loop stability, the sensitivity of closed-loop stability is analysed with respect to both the mantissa and exponent bits of floating-point implementation. A computationally tractable FWL closed-loop stability measure is then defined, and the method of computing the value of this measure is given. The optimal controller realization problem is posed as searching for a floating-point realization that maximizes the proposed FWL closed-loop stability measure, and a numerical optimization technique is adopted to solve for the resulting optimization problem. Simulation results show that the proposed design procedure yields computationally efficient controller realizations with enhanced FWL closed-loop stability performance